The Fermat star of binary treesLUCCIO, Fabrizio; PAGLI, Linda.Information processing letters. 2009, Vol 109, Num 11, pp 568-571, issn 0020-0190, 4 p.Article

Lower bounds on the rotation distance of binary treesLUCCIO, Fabrizio; MESA ENRIQUEZ, Antonio; PAGLI, Linda et al.Information processing letters. 2010, Vol 110, Num 21, pp 934-938, issn 0020-0190, 5 p.Article

Refined upper bounds for right-arm rotation distancesCLEARY, Sean; LUCCIO, Fabrizio; PAGLI, Linda et al.Theoretical computer science. 2007, Vol 377, Num 1-3, pp 277-281, issn 0304-3975, 5 p.Article

k-Restricted rotation distance between binary treesLUCCIO, Fabrizio; ENRIQUEZ, Antonio Mesa; PAGLI, Linda et al.Information processing letters. 2007, Vol 102, Num 5, pp 175-180, issn 0020-0190, 6 p.Article

Compressing and Indexing Labeled Trees, with ApplicationsFERRAGINA, Paolo; LUCCIO, Fabrizio; MANZINI, Giovanni et al.Journal of the Association for Computing Machinery. 2010, Vol 57, Num 1, issn 0004-5411, 4.1-4.33Article

Fast three-level logic minimization based on autosymmetryBERNASCONI, Anna; CIRIANI, Valentina; LUCCIO, Fabrizio et al.Design automation conference. 2002, pp 425-430, isbn 1-58113-461-4, 6 p.Conference Paper

Static optimality theorem for external memory string accessCIRIANI, Valentina; FERRAGINA, Paolo; LUCCIO, Fabrizio et al.Annual Symposium on Foundations of Computer Science. 2002, pp 219-227, isbn 0-7695-1822-2, 9 p.Conference Paper

k-Restricted rotation with an application to search tree rebalancingALMEIDA RUIZ, Alejandro; LUCCIO, Fabrizio; MESA ENRIQUEZ, Antonio et al.Lecture notes in computer science. 2005, pp 2-13, issn 0302-9743, isbn 3-540-28101-0, 12 p.Conference Paper

Dynamic monopolies in toriFLOCCHINI, Paola; LODI, Elena; LUCCIO, Fabrizio et al.Discrete applied mathematics. 2004, Vol 137, Num 2, pp 197-212, issn 0166-218X, 16 p.Conference Paper